Variable and value elimination in binary constraint satisfaction via forbidden patterns
نویسندگان
چکیده
منابع مشابه
Variable and value elimination in binary constraint satisfaction via forbidden patterns
Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. A variable elimination rule (value elimination rule) allows the polynomial-time identification of certain variables (domain elements) whose elimination, without the introduction of extra compensatory constraints, does not affect the satisfiability o...
متن کاملVariable Elimination in Binary CSP via Forbidden Patterns
A variable elimination rule allows the polynomialtime identification of certain variables whose elimination does not affect the satisfiability of an instance. Variable elimination in the constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. We show that there are essentially just four variable elimination rules defined by forbidding gen...
متن کاملConstraint Satisfaction, Logic and Forbidden Patterns
In the early nineties, Feder and Vardi attempted to find a large sub-class of NP which exhibits a dichotomy; that is, where every problem in the sub-class is either solvable in polynomial-time or NP-complete. Their studies resulted in a candidate class of problems, namely those definable in the logic MMSNP. Whilst it remains open as to whether MMSNP exhibits a dichotomy, for various reasons it ...
متن کاملGeneralizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Article history: Received 17 August 2009 Received in revised form 13 February 2010 Accepted 24 March 2010 Available online 27 March 2010
متن کاملCharacterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns
Although the CSP (constraint satisfaction problem) is NP-complete, even in the case when all constraints are binary, certain classes of instances are tractable. We study classes of binary CSP instances defined by excluding subproblems. This approach has recently led to the discovery of novel tractable classes. The complete characterisation of all tractable classes defined by forbidding patterns...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2015
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2015.02.001